#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1;
int n,a[N],w=1,ans=0;
signed main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%d",&n);ans=n;
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	for(int i=2;i<=n;++i)
		if(a[w]<a[i])w++,ans--;
	printf("%d\n",ans);
	fclose(stdin);
	fclose(stdout);
	return 0;
}
